Causal Memory: Implementation, Programming Support and Experiences

نویسندگان

  • Ranjit John
  • Mustaque Ahamad
چکیده

Distributed Shared Memory (DSM) has become an accepted abstraction for programming distributed systems. Although DSM simpliies the programming of distributed applications, maintaining a consistent shared memory can be expensive. Weakly ordered systems which use synchronization information have been proposed to reduce the frequency of communication between processors. We have implemented a weakly ordered system based on the Causal memory model. We provide language and runtime support which allow programs to run eeciently on Causal memory. Actual implementation results show a signiicant reduction in the number of messages when compared to a system maintaining a consistent shared memory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Advanced C++ Library for Symbolic Computing

While having become a mainstream programming language in the computer industry, C++ in its primitive form is known of lacking many advanced features that are common in high-level symbolic programming languages. These features include type flexibility, high-level container constructs, runtime integrity, automatic memory management, among others. Current techniques to support these features in C+...

متن کامل

The causal relationship between active memory, anxiety and depression with mediation of psychological hardiness in people with post traumatic stress disorder in the earthquake in Sarapul Zahab

Background: Post-traumatic stress disorder is a common post-event psychiatric problem that is very painful and stressful and threatens the life of the individual and society. The purpose of this study was to investigate the causal relationship between active memory, anxiety and depression with mediating psychological hardiness in people with post-traumatic stress disorder. Methods: The researc...

متن کامل

A Neuroeconomic Theory of Memory Retrieval

We propose a theory of “optimal memory management” that unveils causal relationships between memory systems and the characteristics of the information retrieved. Our model shows that if the declarative memory is more accurate but also more costly than the procedural memory, then it is optimal to retrieve exceptional experiences with the former and average experiences with the latter. The theory...

متن کامل

Dwarf Frankenstein is still in your memory: tiny code reuse attacks

Code reuse attacks such as return oriented programming and jump oriented programming are the most popular exploitation methods among attackers. A large number of practical and non-practical defenses are proposed that differ in their overhead, the source code requirement, detection rate and implementation dependencies. However, a usual aspect among these methods is consideration of the common be...

متن کامل

Execution Environment Support for Many Core Heterogeneous Accelerator Platforms

We are seeing the advent of large scale, heterogeneous systems comprised of homogeneous general purpose cores intermingled with customized heterogeneous cores and interconnected to diverse memory hierarchies. The presence of accelerators requires support for new programming abstractions and run-time environments that can efficiently harvest platform resources comprised of general purpose and sp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993